An ' S Extremal Problem in Randomgraphs : Forbidding Odd
نویسندگان
چکیده
منابع مشابه
Forbidding Rainbow-colored Stars
We consider an extremal problem motivated by a paper of Balogh [J. Balogh, A remark on the number of edge colorings of graphs, European Journal of Combinatorics 27, 2006, 565–573], who considered edge-colorings of graphs avoiding fixed subgraphs with a prescribed coloring. More precisely, given r ≥ t ≥ 2, we look for n-vertex graphs that admit the maximum number of r-edge-colorings such that at...
متن کاملUpper Bounds for the length of s - Extremal Codes over F 2 , F 4 , and F 2 + u F 2
Our purpose is to find an upper bound for the length of s-extremal codes over F2 (resp. F4) when d ≡ 2 (mod 4) (resp. d odd). This question is left open in [6], [2]. More precisely, we show that there is no s-extremal binary code of length n ≥ 21d− 82 if d > 6 and d ≡ 2 (mod 4). Similarly we show that there is no s-extremal additive F4 code of length n ≥ 13d− 26 if d > 1 and d is odd. We also d...
متن کاملCharacterizing Tightness of LP Relaxations by Forbidding Signed Minors
We consider binary pairwise graphical models and provide an exact characterization (necessary and sufficient conditions observing signs of potentials) of tightness for the LP relaxation on the triplet-consistent polytope of the MAP inference problem, by forbidding an odd-K5 (complete graph on 5 variables with all edges repulsive) as a signed minor in the signed suspension graph. This captures s...
متن کاملFuzzy subgroups of the direct product of a generalized quaternion group and a cyclic group of any odd order
Bentea and Tu{a}rnu{a}uceanu~(An. c{S}tiinc{t}. Univ. Al. I.Cuza Iac{s}, Ser. Nouv{a}, Mat., {bf 54(1)} (2008), 209-220)proposed the following problem: Find an explicit formula for thenumber of fuzzy subgroups of a finite hamiltonian group of type$Q_8times mathbb{Z}_n$ where $Q_8$ is the quaternion group oforder $8$ and $n$ is an arbitrary odd integer. In this paper weconsider more general grou...
متن کاملRadially Moore graphs of radius three and large odd degree
Extremal graphs which are close related to Moore graphs have been defined in different ways. Radially Moore graphs are one of these examples of extremal graphs. Although it is proved that radially Moore graphs exist for radius two, the general problem remains open. Knor, and independently Exoo, gives some constructions of these extremal graphs for radius three and small degrees. As far as we kn...
متن کامل